#include <cstdio>
#include<iostream>
using namespace std;
const int N=1000010;
int n;
int q[N];
int tmp[N];
void merge_sort(int *q,int left,int right)
{
    if(left>=right)return ;
    int mid=(left+right)>>1;//(left+right)/2
    merge_sort(q,left,mid);//左半边拆成两个小块
    merge_sort(q,mid+1,right);//右半边拆成两个小块
    int k=0,i=left,j=mid+1;//
    while(i<=mid&&j<=right)
    {
            if(q[i]<=q[j])tmp[k++]=q[i++];
            else tmp[k++]=q[j++];
    }
    while(i<=mid)tmp[k++]=q[i++];
    while(j<=right)tmp[k++]=q[j++];
    for(int i=left,j=0;i<=right;i++,j++)q[i]=tmp[j];

}
int main()
{
    cin>>n;
    for(int i=0;i<n;i++)cin>>q[i];
    merge_sort(q, 0,n-1);
    for(int i=0;i<n;i++)cout<<q[i];
    getchar();
}